Recursive linear orders with recursive successivities
نویسندگان
چکیده
منابع مشابه
Recursive Linear Orders with Incomplete Successivities
A recursive linear order is said to have intrinsically complete successivities if, in every recursive copy, the successivities form a complete set. We show (Theorem 1) that there is a recursive linear order with intrinsically complete successivities but (Theorem 2) that this cannot be a discrete linear oder. We investigate the related issues of intrinsically non-low and non-semilow successiviti...
متن کاملConsumption-Based Asset Pricing with Recursive Utility
In this paper it has been attempted to investigate the capability of the consumption-based capital asset pricing model (CCAPM), using the general method of moment (GMM), with regard to the Epstien-zin recursive preferences model for Iran's capital market. Generally speaking, recursive utility permits disentangling of the two psychologically separate concepts of risk aversion and elasticity of i...
متن کاملLinear Recursive Functions
With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turingcomplete computation model. However, erasing and copying do not need to be explicitly included in Turing-complete computation models: in this paper we show that the class of partial recursive f...
متن کاملDefining Recursive Predicates in Graph Orders
We study the first order theory of structures over graphs i.e. structures of the form (G, τ ) where G is the set of all (isomorphism types of) finite undirected graphs and τ some vocabulary. We define the notion of a recursive predicate over graphs using Turing Machine recognizable string encodings of graphs. We introduce the notion of a capable structure over graphs, which is one satisfying th...
متن کاملLinear Recursive Sequences
A sequence is an infinite list of numbers, like The numbers in the sequence are called its terms. The general form of a sequence is a 1 , a 2 , a 3 ,. .. where a n is the n-th term of the sequence. In the example (1) above, a 1 = 1, a 2 = 2, a 3 = 4, and so on. The notations {a n } or {a n } ∞ n=1 are abbreviations for a 1 , a Occasionally the indexing of the terms will start with something oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1984
ISSN: 0168-0072
DOI: 10.1016/0168-0072(84)90028-9